home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / b_prio.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  1.6 KB  |  51 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  b_prio.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16.  
  17.  
  18. #ifndef BPRIOH
  19. #define BPRIOH
  20.  
  21. //------------------------------------------------------------------------------
  22. // b_priority_queues: bounded priority queues implemented by b_heaps 
  23. //------------------------------------------------------------------------------
  24.  
  25. #include <LEDA/b_heap.h>
  26.  
  27. typedef b_heap_item b_pq_item;
  28.  
  29. #define b_priority_queue(keytype) name2(keytype,b_priority_queue)
  30.  
  31. #define b_priority_queuedeclare(keytype)\
  32. \
  33. struct b_priority_queue(keytype)  : b_heap \
  34. { b_priority_queue(keytype)(int a, int b): (a,b)  {}\
  35.   ~b_priority_queue(keytype)()  { }\
  36.   b_pq_item insert(keytype k,int info)\
  37.                              { return b_heap::insert(info,Ent(k)); }\
  38.   void decrease_inf(b_pq_item it,int newinf)\
  39.                              { b_heap::decrease_key(it,newinf); }\
  40.   void del_item(b_pq_item x) { b_heap::delete_item(x); }\
  41.   keytype  key(b_pq_item x)  { return keytype(b_heap::info(x)); }\
  42.   int      inf(b_pq_item x)  { return b_heap::key(x); }\
  43.   keytype  del_min()         { return keytype(b_heap::del_min()); }\
  44.   b_pq_item find_min()       { return b_heap::find_min(); }\
  45.   void clear()               { b_heap::clear(); }\
  46.   int empty()                { return (find_min()==0) ? true : false; }\
  47.  };
  48.  
  49. #endif
  50.  
  51.